Satisfiability modulo theories - PDFSEARCH.IO - Document Search Engine

Satisfiability modulo theories
Results: 199

#	Item
71	SMT Workshop 2013 11th International Workshop on Satisfiability Modulo Theories Helsinki, Finland, July 8th and 9th, 2013 Affiliated with the 16th International Conference on Theory and Applications of Satisfiability Tes Add to Reading List Source URL: smt2013.fbk.eu Language: English - Date: 2013-06-03 03:34:19
72	PDF Document Add to Reading List Source URL: www.kroening.com Language: English - Date: 2015-02-13 06:17:10 Formal methods Logic in computer science Vienna Development Method Functional analysis General topology Wellfoundedness Satisfiability modulo theories First-order logic Constructible universe F-algebra Ordinal number Sequence
73	Syntax-Guided Synthesis Rajeev ALUR a , Rastislav BODIK b , Eric DALLAL c , Dana FISMAN a , Pranav GARG d , Garvit JUNIWAL b , Hadas KRESS-GAZIT e , P. MADHUSUDAN d , Milo M. K. MARTIN a , Mukund RAGHOTHAMAN a , Shamwadi Add to Reading List Source URL: sygus.seas.upenn.edu Language: English - Date: 2015-01-10 00:32:21 Predicate logic Theoretical computer science Formal methods NP-complete problems First-order logic Satisfiability Modulo Theories Expression Type system Function Mathematics Logic Mathematical logic
74	First-order reasoning in Yices2 Master Thesis in Computer Science Simon Cruanes∗ supervised by Bruno Dutertre †, Viktor Kuncak ‡, Benjamin Werner § SRI International, Menlo Park, CA September 2011 – March 2012 Add to Reading List Source URL: cedeela.fr Language: English - Date: 2013-02-07 03:54:46 Automated theorem proving Model theory Logic in computer science Constraint programming NP-complete problems Boolean satisfiability problem Satisfiability Modulo Theories DPLL algorithm Interpretation Theoretical computer science Logic Mathematical logic
75	Wedding Boolean Solvers with Superposition: a Societal Reform Simon Cruanes École polytechnique and INRIA, 23 Avenue d’Italie, 75013 Paris, France https://who.rocq.inria.fr/Simon.Cruanes/ Add to Reading List Source URL: cedeela.fr Language: English - Date: 2015-03-03 04:50:17 NP-complete problems Logic in computer science Boolean algebra Electronic design automation Formal methods Satisfiability Modulo Theories Boolean satisfiability problem Solver Boolean data type Theoretical computer science Applied mathematics Mathematics
76	The Polyhedral Model Definitions Operations on Polyhedra Quantifier Elimination and SMT solvers Last Words Add to Reading List Source URL: labexcompilation.ens-lyon.fr Language: English - Date: 2013-05-14 05:12:13 Electronic design automation Formal methods Logic in computer science NP-complete problems Compiler optimizations Polyhedron Satisfiability Modulo Theories Boolean satisfiability problem Linear programming Theoretical computer science Mathematics Applied mathematics
77	Reverse Execution With Constraint Solving Raluca Sauciuc George Necula Electrical Engineering and Computer Sciences Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2013-05-12 14:29:36 Declarative programming Satisfiability Modulo Theories Type system Prolog Symbolic execution Linear programming Theoretical computer science Software engineering Constraint programming
78	Basic Logic, SMT solvers and nitely generated varieties of GBL-algebras Peter Jipsen Chapman University, Orange, California TACL 2013, July 29, Vanderbilt University Add to Reading List Source URL: math.chapman.edu Language: English - Date: 2013-09-06 00:51:19 Algebraic logic Fuzzy logic Logic in computer science Algebraic structures Electronic design automation Satisfiability Modulo Theories MV-algebra Boolean satisfiability problem Propositional variable Mathematics Mathematical logic Logic
79	Sets with Cardinality Constraints in Satisfiability Modulo Theories Philippe Suter? , Robin Steiger, and Viktor Kuncak ´ Ecole Polytechnique F´ed´erale de Lausanne (EPFL), Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-11-10 10:57:45 Metalogic Formal methods Model theory Logic in computer science NP-complete problems First-order logic Satisfiability Modulo Theories Function Interpretation Logic Mathematics Theoretical computer science
80	On Set-Driven Combination of Logics and Verifiers LARA Technical Report, February 2, 2009 Viktor Kuncak1 and Thomas Wies1,2 1 2 Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2009-02-02 09:55:31 Model theory Logic in computer science Metalogic Predicate logic Proof theory First-order logic Satisfiability Modulo Theories Presburger arithmetic Quantifier elimination Logic Mathematical logic Theoretical computer science

UPDATE